Focusing in Linear Meta-logic

نویسندگان

  • Vivek Nigam
  • Dale Miller
چکیده

It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a variety of sequent calculus proof systems. Here, we show that if we adopt different focusing annotations for such linear logic specifications, a range of other proof systems can also be specified. In particular, we show that natural deduction (normal and non-normal), sequent proofs (with and without cut), tableaux, and proof systems using general elimination and general introduction rules can all be derived from essentially the same linear logic specification by altering focusing annotations. By using elementary linear logic equivalences and the completeness of focused proofs, we are able to derive new and modular proofs of the soundness and completeness of these various proofs systems for intuitionistic and classical logics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

in ri a - 00 28 16 31 , v er si on 1 - 2 4 M ay 2 00 8 Focusing in linear meta - logic : extended report

It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a variety of sequent calculus proof systems. Here, we show that if we adopt different focusing annotations for such linear logic specifications, a range of other proof systems can also be specified. In particular, we show...

متن کامل

Multi-Focusing on Extensional Rewriting with Sums

We propose a logical justification for the rewriting-based equivalence procedure for simply-typed lambda-terms with sums of Lindley [Lin07]. It relies on maximally multi-focused proofs, a notion of canonical derivations introduced for linear logic. Lindley’s rewriting closely corresponds to preemptive rewriting [CMS08], a technical device used in the meta-theory of maximal multi-focus. 1998 ACM...

متن کامل

Designing a Meta-Heuristic Algorithm Based on a Simple Seeking Logic

Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...

متن کامل

Type Oriented Logic Meta Programming for Java

This paper presents Type-Oriented Logic Meta Programming. The idea is based on a representation of programs as sets of logic propositions focusing on the type properties of the base-language program. This representation allows generation of base-level code from compiletime logic meta programs that manipulate code fragments and their type properties. We apply this idea to Java and present TyRuBa...

متن کامل

Focusing and Proof - Nets in Linear and Non - Commutative LogicJean -

Linear Logic 4] has raised a lot of interest in computer research, especially because of its resource sensitive nature. One line of research studies proof construction procedures and their interpretation as computational models, in the \Logic Programming" tradition. An eecient proof search procedure, based on a proof normaliza-tion result called \Focusing", has been described in 2]. Focusing is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008